DISTANCE k COLORINGS OF HAMMING GRAPHS
نویسندگان
چکیده
A coloring of the vertices of a graph G is a distance k coloring of G if and only if any two vertices lying on a path of length less than or equal to k are given different colors. Hamming graphs are Cartesian (or box) products of complete graphs. In this paper, we will consider the interaction between coding theory and distance k colorings of Hamming graphs.
منابع مشابه
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered.
متن کاملOn Robust Colorings of Hamming-Distance Graphs
Hq(n, d) is defined as the graph with vertex set Zq and where two vertices are adjacent if their Hamming distance is at least d. The chromatic number of these graphs is presented for various sets of parameters (q, n, d). For the 4-colorings of the graphs H2(n, n − 1) a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness...
متن کاملOn the connectivity threshold for colorings of random graphs and hypergraphs
Let Ωq = Ωq(H) denote the set of proper [q]-colorings of the hypergraph H. Let Γq be the graph with vertex set Ωq and an edge {σ, τ} where σ, τ are colorings iff h(σ, τ) = 1. Here h(σ, τ) is the Hamming distance | {v ∈ V (H) : σ(v) 6= τ(v)} |. We show that if H = Hn,m;k, k ≥ 2, the random k-uniform hypergraph with V = [n] and m = dn/k then w.h.p. Γq is connected if d is sufficiently large and q...
متن کاملTwo Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An n-bit s-deletion correcting code is an independent set in a particular graph. We propose constructing such a code by taking the union of many constant Hamming weight codes. This results in codes that have additional structure. Searching for codes in constant Hamming weigh...
متن کاملConstraining the clustering transition for colorings of sparse random graphs
Let Ωq denote the set of proper q-colorings of the random graphGn,m,m = dn/2 and let Hq be the graph with vertex set Ωq and an edge {σ, τ} where σ, τ are mappings [n]→ [q] iff h(σ, τ) = 1. Here h(σ, τ) is the Hamming distance | {v ∈ [n] : σ(v) 6= τ(v)} |. We show that w.h.p. Hq contains a single giant component containing almost all colorings in Ωq if d is sufficiently large and q ≥ cd log d fo...
متن کامل